Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles
نویسندگان
چکیده
The notion of gregarious cycles in complete multipartite graphs was introduced by Billington and Hoffman in 2003 and was modified later by Billington, Hoffman, and Rodger and by Billington, Smith, and Hoffman. In this paper, we propose a new definition of gregarious cycles in complete multipartite graphs which generalizes all of the three definitions. With our definition, we can consider gregarious cycles of long length in complete multipartite graphs, and we show some results on the existence of edge-disjoint decompositions of complete multipartite graphs into gregarious long cycles.
منابع مشابه
A Difference Set Method for Circular Decompositions of Complete Multipartite Graphs into Gregarious 4-cycles
A cycle in a multipartite graph G is gregarious if it contains at most one vertex from each partite set of G. The complete n-partite graph with partite sets of size m, denoted by Kn(m) is shown to have a decomposition into gregarious 4-cycles. The notion of a gregarious 4-cycle decomposition of this type was introduced in [3]. A 4-cycle decomposition of Kn(m) is circular if it is it is invarian...
متن کاملDecompositions of Complete Multipartite Graphs into Gregarious 6-cycles Using Complete Differences
The complete multipartite graph Kn(2t) having n partite sets of size 2t, with n ≥ 6 and t ≥ 1, is shown to have a decomposition into gregarious 6-cycles, that is, the cycles which have at most one vertex from any particular partite set. Complete sets of differences of numbers in Zn are used to produce starter cycles and obtain other cycles by rotating the cycles around the n-gon of the partite ...
متن کاملON DECOMPOSITIONS OF THE COMPLETE EQUIPARTITE GRAPHS Kkm(2t) INTO GREGARIOUS m-CYCLES
For an even integer m at least 4 and any positive integer t, it is shown that the complete equipartite graph Kkm(2t) can be decomposed into edge-disjoint gregarious m-cycles for any positive integer k under the condition satisfying (m−1)+3 4m < k. Here it will be called a gregarious cycle if the cycle has at most one vertex from each partite set.
متن کاملResolvable gregarious cycle decompositions of complete equipartite graphs
The complete multipartite graph Kn(m) with n parts of size m is shown to have a decomposition into n-cycles in such a way that each cycle meets each part of Kn(m); that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable. © 2007 Elsevier B.V. All rights reserved.
متن کاملSome gregarious kite decompositions of complete equipartite graphs
A k-cycle decomposition of a multipartite graph G is said to be gregarious if each k-cycle in the decomposition intersects k distinct partite sets of G. In this paper we prove necessary and sufficient conditions for the existence of such a decomposition in the case where G is the complete equipartite graph, having n parts of size m, and either n ≡ 0, 1 (mod k), or k is odd and m ≡ 0 (mod k). As...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012